Generalized Conditioning in Neighbourhood Models
نویسنده
چکیده
Sets of probability measures which form neighbourhoods of classical probability measures are studied. An application of Jeffrey’s rule of conditioning to forming neighbourhoods of probability measures is proposed. Neighbourhoods that are closed for generalized conditioning according to this rule are characterized. They are shown to be exactly convex and bi-elastic neighbourhoods.
منابع مشابه
Large-scale Inversion of Magnetic Data Using Golub-Kahan Bidiagonalization with Truncated Generalized Cross Validation for Regularization Parameter Estimation
In this paper a fast method for large-scale sparse inversion of magnetic data is considered. The L1-norm stabilizer is used to generate models with sharp and distinct interfaces. To deal with the non-linearity introduced by the L1-norm, a model-space iteratively reweighted least squares algorithm is used. The original model matrix is factorized using the Golub-Kahan bidiagonalization that proje...
متن کاملω-NARROWNESS AND RESOLVABILITY OF TOPOLOGICAL GENERALIZED GROUPS
Abstract. A topological group H is called ω -narrow if for every neighbourhood V of it’s identity element there exists a countable set A such that V A = H = AV. A semigroup G is called a generalized group if for any x ∈ G there exists a unique element e(x) ∈ G such that xe(x) = e(x)x = x and for every x ∈ G there exists x − 1 ∈ G such that x − 1x = xx − 1 = e(x). Also le...
متن کاملValid auto-models for spatially autocorrelated occupancy and abundance data
Spatially autocorrelated species abundance or distribution datasets typically generate spatially autocorrelated residuals in generalized linear models; a broader modelling framework is therefore required. Auto-logistic and related auto-models, implemented approximately as autocovariate regression, provide simple and direct modelling of spatial dependence. The autologistic model has been widely ...
متن کاملThe Neighbourhood Polynomial of some Nanostructures
The neighbourhood polynomial G , is generating function for the number of faces of each cardinality in the neighbourhood complex of a graph. In other word $N(G,x)=sum_{Uin N(G)} x^{|U|}$, where N(G) is neighbourhood complex of a graph, whose vertices are the vertices of the graph and faces are subsets of vertices that have a common neighbour. In this paper we compute this polynomial for some na...
متن کاملUsing directed acyclic graphs to guide analyses of neighbourhood health effects: an introduction.
BACKGROUND Directed acyclic graphs, or DAGs, are a useful graphical tool in epidemiologic research that can help identify appropriate analytical strategies in addition to potential unintended consequences of commonly used methods such as conditioning on mediators. The use of DAGs can be particularly informative in the study of the causal effects of social factors on health. METHODS The author...
متن کامل